OPEN SYNCHRONOUS CELLULAR LEARNING AUTOMATA
نویسندگان
چکیده
منابع مشابه
Open Synchronous Cellular Learning Automata
Cellular learning automata is a combination of learning automata and cellular automata. This model is superior to cellular learning automata because of its ability to learn and also is superior to single learning automaton because it is a collection of learning automata which can interact together. In some applications such as image processing, a type of cellular learning automata in which the ...
متن کاملImproved Frog Leaping Algorithm Using Cellular Learning Automata
In this paper, a new algorithm which is the result of the combination of cellular learning automata and frog leap algorithm (SFLA) is proposed for optimization in continuous, static environments.At the proposed algorithm, each memeplex of frogs is placed in a cell of cellular learning automata. Learning automata in each cell acts as the brain of memeplex, and will determine the strategy of moti...
متن کاملCellular Edge Detection: Combining Cellular Automata and Cellular Learning Automata
In this paper, we propose a Cellular Edge Detection (CED) algorithm which utilizes Cellular Automata (CA) and Cellular Learning Automata (CLA). The CED algorithm is an adaptive, intelligent and learnable algorithm for edge detection of binary and grayscale images. Here, we introduce a new CA local rule with adaptive neighborhood type to produce the edge map of image as opposed to CA with fixed ...
متن کاملAsynchronous cellular learning automata
Cellular learning automata is a combination of cellular automata and learning automata. The synchronous version of cellular learning automata in which all learning automata in different cells are activated synchronously, has found many applications. In some applications a type of cellular learning automata in which learning automata in different cells are activated asynchronously (asynchronous ...
متن کاملSynchronous and Asynchronous Learning by Responsive Learning Automata
We consider the ability of economic agents to learn in a decentralized environment in which agents do not know the (stochastic) payoo matrix and can not observe their opponents' actions; they merely know, at each stage of the game, their own action and the resulting payoo. We discuss the requirements for learning in such an environment, and show that a simple probabilistic learning algorithm sa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Complex Systems
سال: 2007
ISSN: 0219-5259,1793-6802
DOI: 10.1142/s0219525907001264